The smaller the value of the merit function is , the closer the iteration point is to the solution 當價值函數(shù)的值越小時,迭代點越靠近最優(yōu)解。
This algorithm allows the search direction with only moderate accuracy , and does not require the feasibility of the iteration points 該算法允許搜索方向有相對較大的誤差,且不要求迭代點的可行性。
Without the strict feasibility of the initial points and iteration points , the algorithm is shown to possess both polynomial - time complexity and q - linear convergence 該算法不要求初始點及迭代點的可行性且具有q -線性收斂速度和多項式時間復雜性。